Streamline Uniform Placement Algorithm With Dynamic Seed Points
نویسندگان
چکیده
منابع مشابه
Adaptive Dynamic Data Placement Algorithm for Hadoop in Heterogeneous Environments
Hadoop MapReduce framework is an important distributed processing model for large-scale data intensive applications. The current Hadoop and the existing Hadoop distributed file system’s rack-aware data placement strategy in MapReduce in the homogeneous Hadoop cluster assume that each node in a cluster has the same computing capacity and a same workload is assigned to each node. Default Hadoop d...
متن کاملPSO-Based Optimization of 2D Streamline Placement
In scientific visualization, we often handle vector or direction fields. An efficient way of visualizing such a vector or direction field is to cover the whole domain studied by a set of streamlines because they give good information about the flow and the topology of the underlying field. In this article, we propose to optimize already constructed streamlines by defining an optimization criter...
متن کاملInteractive view-driven evenly spaced streamline placement
This paper presents an Interactive View-Driven Evenly Spaced Streamline placement algorithm (IVDESS) for 3D explorative visualization of large complex planar or curved surface flows. IVDESS rapidly performs accurate streamline integration in 3D physical space, i.e., the flow field, while achieving high quality streamline density control in 2D view space, i.e., the output image. The corresponden...
متن کاملGlyph and Streamline Placement Algorithms for Cfd Data Glyph and Streamline Placement Algorithms for Cfd Simulation Data
Visualization of flow on boundary surfaces from computational flow dynamics (CFD) is challenging due to the complex, adaptive resolution nature of the meshes used in the modeling and simulation process. Part one of this paper presents a fast and simple glyph placement algorithm in order to investigate and visualize flow data based on unstructured, adaptive resolution boundary meshes from CFD. T...
متن کاملAn algorithm to estimate the vertices of a tetrahedron with uniform random points inside
Using n uniform random points inside an arbitrary tetrahedron, we give an algorithm to estimate its vertices. The accuracy of the algorithm is proved by applying a Monte Carlo simulation technique.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2019
ISSN: 2169-3536
DOI: 10.1109/access.2019.2935461